Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar3/TRCSRSLASHEx4_7_15_Bor03

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(0) -> cons₁(0)
f₁(s₁(0)) -> f₁(p₁(s₁(0)))
p₁(s₁(0)) -> 0

Q is empty.

↳ QTRS

  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(0) -> cons₁(0)
f₁(s₁(0)) -> f₁(p₁(s₁(0)))
p₁(s₁(0)) -> 0

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(0) -> cons₁(0)
f₁(s₁(0)) -> f₁(p₁(s₁(0)))
p₁(s₁(0)) -> 0

The set Q consists of the following terms:

f₁(0)
f₁(s₁(0))
p₁(s₁(0))

Q DP problem:
The TRS P consists of the following rules:

F₁(s₁(0)) -> P₁(s₁(0))
F₁(s₁(0)) -> F₁(p₁(s₁(0)))

The TRS R consists of the following rules:

f₁(0) -> cons₁(0)
f₁(s₁(0)) -> f₁(p₁(s₁(0)))
p₁(s₁(0)) -> 0

The set Q consists of the following terms:

f₁(0)
f₁(s₁(0))
p₁(s₁(0))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F₁(s₁(0)) -> P₁(s₁(0))
F₁(s₁(0)) -> F₁(p₁(s₁(0)))

The TRS R consists of the following rules:

f₁(0) -> cons₁(0)
f₁(s₁(0)) -> f₁(p₁(s₁(0)))
p₁(s₁(0)) -> 0

The set Q consists of the following terms:

f₁(0)
f₁(s₁(0))
p₁(s₁(0))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 0 SCCs with 2 less nodes.